Feasible edge colorings of trees with cardinality constraints
نویسندگان
چکیده
منابع مشابه
Feasible edge colorings of trees with cardinality constraints
A variation of preemptive open shop scheduling corresponds to nding a feasible edge coloring in a bipartite multigraph with some requirements on the size of the di erent color classes. We show that for trees with xed maximum degree, one can nd in polynomial time an edge k-coloring where for i = 1; : : : ; k the number of edges of color i is exactly a given number hi, and each edge e gets its co...
متن کاملOn cyclically-interval edge colorings of trees
For an undirected, simple, finite, connected graph G, we denote by V (G) and E(G) the sets of its vertices and edges, respectively. A function φ : E(G) → {1, 2, . . . , t} is called a proper edge t-coloring of a graph G if adjacent edges are colored differently and each of t colors is used. An arbitrary nonempty subset of consecutive integers is called an interval. If φ is a proper edge t-color...
متن کاملA Note On Vertex Distinguishing Edge colorings of Trees
A proper edge coloring of a simple graph G is called a vertex distinguishing edge coloring (vdec) if for any two distinct vertices u and v of G, the set of the colors assigned to the edges incident to u differs from the set of the colors assigned to the edges incident to v. The minimum number of colors required for all vdecs of G is denoted by χ ′ s (G) called the vdec chromatic number of G. Le...
متن کاملPoint-Set Embedding of Trees with Edge Constraints
Given a graph G with n vertices and a set S of n points in the plane, a point-set embedding of G on S is a planar drawing such that each vertex of G is mapped to a distinct point of S. A geometric point-set embedding is a point-set embedding with no edge bends. This paper studies the following problem: The input is a set S of n points, a planar graph G with n vertices, and a geometric point-set...
متن کاملSubmodular Maximization with Cardinality Constraints
We consider the problem of maximizing a (non-monotone) submodular function subject to a cardinality constraint. In addition to capturing well-known combinatorial optimization problems, e.g., Maxk-Coverage and Max-Bisection, this problem has applications in other more practical settings such as natural language processing, information retrieval, and machine learning. In this work we present impr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00006-6